Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive De nite Systems : Preliminary Results

نویسندگان

  • Anshul Gupta
  • Fred Gustavson
  • Mahesh Joshi
  • George Karypis
  • Vipin Kumar
چکیده

Solving large sparse systems of linear equations is at the core of many problems in engineering and scienti c computing. It has long been a challenge to develop parallel formulations of sparse direct solvers due to several di erent complex steps involved in the process. In this paper, we describe one of the rst e cient, practical, and robust parallel solvers for sparse symmetric positive de nite linear systems that we have developed and discuss the algorithmic and implementation issues involved in its development.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSPASES: An E cient and Scalable Parallel Sparse Direct Solver

Many problems in engineering and scienti c domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop e cient parallel formulations of sparse direct solvers due to several di erent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst e cient, portable...

متن کامل

PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver

Many problems in engineering and scienti c domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop e cient parallel formulations of sparse direct solvers due to several di erent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst e cient, portable...

متن کامل

Incomplete Cholesky Parallel Preconditioners with Selective Inversion

Consider the solution of a large linear system when the coe cient matrix is sparse, symmetric, and positive de nite. One approach is the method of \conjugate gradient" (CG) with an incomplete Cholesky (IC) preconditioner (ICCG). A key problem with the design of a parallel ICCG solver is the bottleneck posed by repeated parallel sparse triangular solves to apply the preconditioner. Our work conc...

متن کامل

Pspases: an Eecient and Scalable Parallel Sparse Direct Solver

Many problems in engineering and scientiic domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop eecient parallel formulations of sparse direct solvers due to several diierent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst eecient, portable...

متن کامل

A Scalable Parallel Algorithm for Sparse MatrixFactorization

In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, analyze its performance and scalability, and present experimental results of its implementation on a 1024-processor nCUBE2 parallel computer. Through our analysis and experimental results, we demonstrate that our algorithm improves the state of the art in parallel direct solution of sparse linear systems b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997